-
1 примитивно-рекурсивная схема
Русско-английский научно-технический словарь Масловского > примитивно-рекурсивная схема
-
2 примитивно-рекурсивная схема
Русско-английский словарь по вычислительной технике и программированию > примитивно-рекурсивная схема
-
3 рекурсивный
1. recursively2. recursiveРусско-английский словарь по информационным технологиям > рекурсивный
-
4 частичноный рекурсивный
Русско-английский новый политехнический словарь > частичноный рекурсивный
-
5 примитивный
1. primitive2. primitively -
6 примитивный
1. primitive2. primitivelyРусско-английский словарь по информационным технологиям > примитивный
-
7 примитивный
1. ignorant2. primitiveСинонимический ряд:просто (проч.) просто; элементарно -
8 примитивный
1. primitive2. primitively -
9 собственно примитивный
Русско-английский военно-политический словарь > собственно примитивный
-
10 вычислительная схема
схема маркировки; схема расстановки меток — labeling scheme
Русско-английский большой базовый словарь > вычислительная схема
-
11 схема
1. ж. diagram2. ж. circuit; circuit designсхема записи; цепь записи — writing circuit
3. ж. scheme, planкоммутационная схема — diagram of connections; wiring diagram
логическая схема — logic ; logic system
схема маркировки; схема расстановки меток — labeling scheme
-
12 собственно примитивный
-
13 примитивно рекурсивная схема
Mathematics: primitive recursive schemeУниверсальный русско-английский словарь > примитивно рекурсивная схема
-
14 примитивно-рекурсивная схема
Logics: primitive recursive schemeУниверсальный русско-английский словарь > примитивно-рекурсивная схема
См. также в других словарях:
Super-recursive algorithm — In computer science and computability theory, super recursive algorithms are algorithms that are more powerful, that is, compute more, than Turing machines. The term was introduced by Mark Burgin, whose book Super recursive algorithms develops… … Wikipedia
McCarthy Formalism — In computer science and recursion theory the McCarthy Formalism (1963) of computer scientist John McCarthy clarifies the notion of recursive functions by use of the IF THEN ELSE construction common to computer science, together with the four of… … Wikipedia
mathematics, foundations of — Scientific inquiry into the nature of mathematical theories and the scope of mathematical methods. It began with Euclid s Elements as an inquiry into the logical and philosophical basis of mathematics in essence, whether the axioms of any system… … Universalium
History of the Church–Turing thesis — This article is an extension of the history of the Church–Turing thesis. The debate and discovery of the meaning of computation and recursion has been long and contentious. This article provides detail of that debate and discovery from Peano s… … Wikipedia
Algorithm characterizations — The word algorithm does not have a generally accepted definition. Researchers are actively working in formalizing this term. This article will present some of the characterizations of the notion of algorithm in more detail. This article is a… … Wikipedia
History of the Church-Turing thesis — This article is an extension of the history of the Church Turing thesis.The debate and discovery of the meaning of computation and recursion has been long and contentious. This article provides detail of that debate and discovery from Peano s… … Wikipedia
Axiom — This article is about logical propositions. For other uses, see Axiom (disambiguation). In traditional logic, an axiom or postulate is a proposition that is not proven or demonstrated but considered either to be self evident or to define and… … Wikipedia
First-order logic — is a formal logical system used in mathematics, philosophy, linguistics, and computer science. It goes by many names, including: first order predicate calculus, the lower predicate calculus, quantification theory, and predicate logic (a less… … Wikipedia
Gödel's incompleteness theorems — In mathematical logic, Gödel s incompleteness theorems, proved by Kurt Gödel in 1931, are two theorems stating inherent limitations of all but the most trivial formal systems for arithmetic of mathematical interest. The theorems are of… … Wikipedia
Gödel numbering for sequences — A Gödel numbering for sequences provides us an effective way to represent each finite sequence of natural numbers as a single natural number. Of course, the embedding is surely possible set theoretically, but the emphasis is on the effectiveness… … Wikipedia
Список терминов, относящихся к алгоритмам и структурам данных — Это служебный список статей, созданный для координации работ по развитию темы. Данное предупреждение не устанавливается на информационные списки и глоссарии … Википедия